On Automated Defeasible Reasoning with Controlled Natural Language and Argumentation
نویسندگان
چکیده
We present an approach to reasoning with strict and defeasible rules over literals. A controlled natural language is employed as human/machine interface to facilitate the specification of knowledge and verbalization of results. Reasoning on the rules is done by a direct semantics that addresses several issues for current approaches to argumentation-based defeasible reasoning. Techniques from formal argumentation theory are employed to justify conclusions of the approach; therefore, we not only address automated reasoning but also human acceptance of provided conclusions.
منابع مشابه
Questions, Arguments, and Natural Language Semantics
Computational models of argumentation can be understood to bridge between human and automated reasoning. Argumentation schemes represent stereotypical, defeasible reasoning patterns. Critical questions are associated with argumentation schemes and are said to attack arguments. The paper highlights several issues with the current understanding of critical questions in argumentation. It provides ...
متن کاملdARe - Using Argumentation to Explain Conclusions from a Controlled Natural Language Knowledge Base
We present an approach to reasoning with knowledge bases comprised of strict and defeasible rules over literals. A controlled natural language is proposed as a human/machine interface to facilitate the specification of knowledge and verbalisation of results. Techniques from formal argumentation theory are employed to justify conclusions of the approach; this aims at facilitating human acceptanc...
متن کاملA Rgue ! - an Implemented System for Computer - Mediated Defeasible
This paper introduces the Argue!-system. It is an example of a system for computer-mediated defeasible argumentation, a new trend in the field of defeasible argumentation. In this research, computer systems are developed that can be used to mediate the process of argumentation of one or more users. Argument-mediation systems should be contrasted with systems for automated reasoning: the latter ...
متن کاملDefeasible AceRules: A Prototype
The paper adapts the syntax of the AceRules system, an existing controlled natural language (CNL), and pipes the resulting output rules to a defeasible inference engine. With this, we can represent and reason with knowledge bases (KB) with strict and defeasible rules. For strict rules, the consequent of a strict rule must hold if the premises hold; for a defeasible rule, the consequent of a def...
متن کاملA Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number of different real-world applications, D...
متن کامل